Uniform convexity. III

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Uniform Convexity Of

The standard proof of the uniform convexity of L using Clarkson’s [1] or Hanner’s [2] inequalities (see also [4]) is rarely taught in functional analysis classes, in part (the author imagines) because the proofs of those inequalities are quite non-intuitive and unwieldy. We present here a direct proof, cheerfully sacrificing the optimal bounds – for which, see [2, 4]. It fits quite nicely in wi...

متن کامل

POWER TYPE UNIFORM CONVEXITY OF X VIA p - ASYMPTOTIC UNIFORM CONVEXITY OF L r ( X

We show that if Lr(X), 1 < r < ∞, has an asymptotically uniformly convex renorming of power type then X admits a uniformly convex norm of power type.

متن کامل

Uniform Estimates and Convexity in Capillary Surfaces

We prove uniform convexity of solutions to the capillarity boundary value problem for fixed boundary angle in (0, π/2) and strictly positive capillarity constant provided that the base domain Ω ⊂ R is sufficiently close to a disk in a suitable C-sense.

متن کامل

Nearly Uniform Convexity of Infinite Direct Sums

Those kinds of infinite direct sums are characterized for which NUC (NUS, respectively) is inherited from the component spaces to the direct sum. 1. NUC and the lower KK-modulus. The Banach space X is said to be nearly uniformly convex, abbreviated NUC (cf. [2]), if: for every ε > 0, there exists δ > 0 such that the convex hull conv{xn} of every sequence {xn} in the unit ball BX of X with separ...

متن کامل

A Uniform Model for Almost Convexity and Rewriting Systems

We introduce a topological property for finitely generated groups called stackable that implies the existence of an inductive procedure for constructing van Kampen diagrams with respect to a particular finite presentation. We also define algorithmically stackable groups, for which this procedure is an algorithm. This property gives a common model for algorithms arising from both rewriting syste...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of the American Mathematical Society

سال: 1943

ISSN: 0002-9904

DOI: 10.1090/s0002-9904-1943-08019-6